RANDOMIZED DIVIDE-AND-CONQUER: IMPROVED PATH, MATCHING, AND PACKING ALGORITHMSCHEN, Jianer; KNEIS, Joachim; LU, Songjian et al.SIAM journal on computing (Print). 2009, Vol 38, Num 6, pp 2526-2547, issn 0097-5397, 22 p.Article

SMALL-SIZE ε-NETS FOR AXIS-PARALLEL RECTANGLES AND BOXESARONOV, Boris; EZRA, Esther; SHARIR, Micha et al.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3248-3282, issn 0097-5397, 35 p.Article

VISION-BASED PURSUIT-EVASION IN A GRIDDUMITRESCU, Adrian; KOK, Howi; SUZUKI, Ichiro et al.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 3, pp 1177-1204, issn 0895-4801, 28 p.Article

ESTIMATING THE WEIGHT OF METRIC MINIMUM SPANNING TREES IN SUBLINEAR TIMECZUMAJ, Artur; SOHLER, Christian.SIAM journal on computing (Print). 2010, Vol 39, Num 3, pp 904-922, issn 0097-5397, 19 p.Article

A CONSTANT FACTOR APPROXIMATION FOR THE SINGLE SINK EDGE INSTALLATION PROBLEMGUHA, Sudipto; MEYERSON, Adam; MUNAGALA, Kamesh et al.SIAM journal on computing (Print). 2009, Vol 38, Num 6, pp 2426-2442, issn 0097-5397, 17 p.Article

Online conflict-free coloring for intervalsCHEN, K. E; FIAT, Amos; WELZL, Emo et al.SIAM journal on computing (Print). 2007, Vol 36, Num 5, pp 1342-1359, issn 0097-5397, 18 p.Article

ALGEBRAIC ALGORITHMS FOR MATCHING AND MATROID PROBLEMSHARVEY, Nicholas J. A.SIAM journal on computing (Print). 2010, Vol 39, Num 2, pp 679-702, issn 0097-5397, 24 p.Conference Paper

ON PROXIMITY-OBLIVIOUS TESTINGGOLDREICH, Oded; RON, Dana.SIAM journal on computing (Print). 2011, Vol 40, Num 2, pp 534-566, issn 0097-5397, 33 p.Article

A COMBINATORIAL CHARACTERIZATION OF THE TESTABLE GRAPH PROPERTIES: IT'S ALL ABOUT REGULARITYALON, Noga; FISCHER, Eldar; NEWMAN, Ilan et al.SIAM journal on computing (Print). 2009, Vol 39, Num 1, pp 143-167, issn 0097-5397, 25 p.Article

ONLINE SCHEDULING OF EQUAL-LENGTH JOBS : RANDOMIZATION AND RESTARTS HELPCHROBAK, Marek; JAWOR, Wojciech; SGALL, Jiri et al.SIAM journal on computing (Print). 2007, Vol 36, Num 6, pp 1709-1728, issn 0097-5397, 20 p.Article

STREAM ORDER AND ORDER STATISTICS: QUANTILE ESTIMATION IN RANDOM-ORDER STREAMSGUHA, Sudipto; MCGREGOR, Andrew.SIAM journal on computing (Print). 2009, Vol 38, Num 5, pp 2044-2059, issn 0097-5397, 16 p.Article

ON THE POWER OF RANDOMIZATION FOR JOB SHOP SCHEDULING WITH k-UNITS LENGTH TASKSMÖMKE, Tobias.Informatique théorique et applications (Imprimé). 2009, Vol 43, Num 2, pp 189-207, issn 0988-3754, 19 p.Article

Deterministic extractors for bit-fixing sources and exposure-resilient cryptographyKAMP, Jesse; ZUCKERMAN, David.SIAM journal on computing (Print). 2007, Vol 36, Num 5, pp 1231-1247, issn 0097-5397, 17 p.Article

Ski rental with two general optionsLOTKER, Zvi; PATT-SHAMIR, Boaz; RAWITZ, Dror et al.Information processing letters. 2008, Vol 108, Num 6, pp 365-368, issn 0020-0190, 4 p.Article

All-pairs nearly 2-approximate shortest paths in O(n²polylog n) timeBASWANA, Surender; GOYAL, Vishrut; SEN, Sandeep et al.Theoretical computer science. 2009, Vol 410, Num 1, pp 84-93, issn 0304-3975, 10 p.Article

ALGORITHMIC ASPECTS OF PROPERTY TESTING IN THE DENSE GRAPHS MODELGOLDREICH, Oded; RON, Dana.SIAM journal on computing (Print). 2011, Vol 40, Num 2, pp 376-445, issn 0097-5397, 70 p.Article

On randomized algorithms for the majority problemCHRISTOFIDES, Demetres.Discrete applied mathematics. 2009, Vol 157, Num 7, pp 1481-1485, issn 0166-218X, 5 p.Article

An approximate L¹-difference algorithm for massive data streamsFEIGENBAUM, Joan; KANNAN, Sampath; STRAUSS, Martin J et al.SIAM journal on computing (Print). 2003, Vol 32, Num 1, pp 131-151, issn 0097-5397, 21 p.Article

AN APPROXIMATION ALGORITHM FOR MAX-MIN FAIR ALLOCATION OF INDIVISIBLE GOODSASADPOUR, Arash; SABERI, Amin.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 2970-2989, issn 0097-5397, 20 p.Article

LINE TRANSVERSALS OF CONVEX POLYHEDRA IN ℝ³KAPLAN, Haim; RUBIN, Natan; SHARIR, Micha et al.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3283-3310, issn 0097-5397, 28 p.Article

RESOLUTION IS NOT AUTOMATIZABLE UNLESS W[P] IS TRACTABLEALEKHNOVICH, Michael; RAZBOROV, Alexander A.SIAM journal on computing (Print). 2009, Vol 38, Num 4, pp 1347-1363, issn 0097-5397, 17 p.Article

Randomized strategies for the plurality problemKRAL, Daniel; SGALL, Jiri; TICHY, Tomas et al.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3305-3311, issn 0166-218X, 7 p.Conference Paper

Approximating the weight of the euclidean minimum spanning tree in sublinear timeCZUMAJ, Artur; ERGÜN, Funda; FORTNOW, Lance et al.SIAM journal on computing (Print). 2006, Vol 35, Num 1, pp 91-109, issn 0097-5397, 19 p.Article

Online multi-coloring on the path revisitedCHRIST, Marie G; FAVRHOLDT, Lene M; LARSEN, Kim S et al.Acta informatica. 2013, Vol 50, Num 5-6, pp 343-357, issn 0001-5903, 15 p.Article

A shortest cycle for each vertex of a graphYUSTER, Raphael.Information processing letters. 2011, Vol 111, Num 21-22, pp 1057-1061, issn 0020-0190, 5 p.Article